#define	_CRT_SECURE_NO_WARNINGS 1 
#include "TreeNode.h";
#include "Queue.h";

int main()
{
	BTDataType a[] = { "ABD##E#H##CF##G##" };
	int pi = 0;
	BTNode* root = BinaryTreeCreate(a, &pi);
	int Treesize = BinaryTreeSize(root);
	printf("%d\n", Treesize);

	int TreeLeafSize = BinaryTreeLeafSize(root);
	printf("%d\n", TreeLeafSize);

	int TreeLevelKSize = BinaryTreeLevelKSize(root, 2);
	printf("%d\n", TreeLevelKSize);

	BTNode* findroot = BinaryTreeFind(root, 'C');
	printf("%p\n", findroot);

	BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");
	BinaryTreeLevelOrder(root);
	int ret = BinaryTreeComplete(root);
	printf("BinaryTreeComplete:%d\n", ret);
	BinaryTreeDestory(&root);
	int TreeSize = BinaryTreeSize(root);
	printf("%d\n", TreeSize);
	return 0;
}
